翻訳と辞書 |
mixed graph
A mixed graph ''G'' = (''V'', ''E'', ''A'') is a mathematical object consisting of a set of vertices (or nodes) ''V'', a set of (undirected) edges ''E'', and a set of directed edges (or arcs) ''A''. ==Definitions and Notation==
Consider adjacent vertices . A directed edge, called an arc, is an edge with an orientation and can be denoted as or (note that is the tail and is the head of the arc). Also, an undirected edge, or edge, is an edge with no orientation and can be denoted as or .〔 For the purpose of our application example we will not be considering loops or multiple edges of mixed graphs. A cycle of a mixed graph, or mixed cycle, is formed if the directed edges of the mixed graph form a cycle.〔 An orientation of a mixed graph is considered acyclic if cycles cannot be formed from the directed edges.〔 We call a mixed graph acyclic if all of its orientations are acyclic.〔
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「mixed graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|